Decoding algorithm and architecture for BCH codes under the Lee Metric
نویسندگان
چکیده
منابع مشابه
Decoding a Class of Alternant Codes for the Lee Metric
Following are the abstracts of contributions (i.e., talks and posters) to the 13th Annual Meeting of the IMS held at the National University of Ireland Maynooth, 6–8 September 2000. The abbreviations after the names designate: ‘M’ for main speaker, ‘S’ for speaker, ‘RS’ for research student, and ‘P’ for poster. The abstracts are included as provided by the contributors for this volume of the Bu...
متن کاملSupport Vector Machine based Decoding Algorithm for BCH Codes
Modern communication systems require robust, adaptable and high performance decoders for efficient data transmission. Support Vector Machine (SVM) is a margin based classification and regression technique. In this paper, decoding of Bose Chaudhuri Hocquenghem codes has been approached as a multi-class classification problem using SVM. In conventional decoding algorithms, the procedure for decod...
متن کاملA Decoding Algorithm for Rank Metric Codes
In this work we will present algorithms for decoding rank metric codes. First we will look at a new decoding algorithm for Gabidulin codes using the property of Dickson matrices corresponding to linearized polynomials. We will be using a Berlekamp-Massey-like algorithm in the process. We will show the difference between our and existing algorithms. Apart from being a new algorithm, it is also i...
متن کاملOn the decoding of quasi-BCH codes
In this paper we investigate the structure of quasi-BCH codes. In the first part of this paper we show that quasi-BCH codes can be derived from Reed-Solomon codes over square matrices extending the known relation about classical BCH and Reed-Solomon codes. This allows us to adapt the Welch-Berlekamp algorithm to quasi-BCH codes. In the second part of this paper we show that quasi-BCH codes can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2008
ISSN: 0090-6778,1558-0857
DOI: 10.1109/tcomm.2008.041227